The Power of Asymmetry in Binary Hashing
نویسندگان
چکیده
When approximating binary similarity using the hamming distance between short binary hashes, we show that even if the similarity is symmetric, we can have shorter and more accurate hashes by using two distinct code maps. I.e. by approximating the similarity between x and x′ as the hamming distance between f(x) and g(x′), for two distinct binary codes f, g, rather than as the hamming distance between f(x) and f(x′).
منابع مشابه
Compressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملThe comparison of alpha power, peak alpha frequency, frontal alpha asymmetry between irritable bowel syndrome and healthy people
Irritable bowel syndrome (IBS) is a chronic functional gastrointestinal disorder that is characterized by abdominal pain or discomfort and changed intestinal habits. The aim of This study was the comparison of features of brain oscillations in alpha frequency band by using rest-electroencephalography (EEG) between patients with IBS and healthy control. 11 IBS patients (7 female and 4 male) and ...
متن کاملDual local consistency hashing with discriminative projections selection
Semantic hashing is a promising way to accelerate similarity search, which designs compact binary codes for a large number of images so that semantically similar images are mapped to close codes. Retrieving similar neighbors is then simply accomplished by retrieving images that have codes within a small Hamming distance of the code of the query. However, most of the existing hashing approaches,...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will lead to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for perce...
متن کامل